Envelope stepsize control for iterative algorithms based on Fejer processes with attractants
نویسنده
چکیده
Fejer processes are frequently used models for many iterative algorithms in optimization and related areas. They can be combined with different kinds of decomposition schemes and generate various projectiontype methods suitable for parallel computations. This paper reviews some recent results on Fejer processes with diminishing disturbances and suggests a new adaptive parameter-free stepsize control rule for such algorithms.
منابع مشابه
Adaptive Stepsize Control in Implicit Runge-Kutta Methods for Reservoir Simulation
This paper concerns predictive stepsize control applied to high order methods for temporal discretization in reservoir simulation. The family of Runge-Kutta methods is presented and in particular the explicit singly diagonally implicit Runge-Kutta (ESDIRK) methods are described. A predictive stepsize adjustment rule based on error estimates and convergence control of the integrated iterative so...
متن کاملAn adaptive homotopy approach for non-selfadjoint eigenvalue problems
This paper presents adaptive algorithms for eigenvalue problems associated with non-selfadjoint partial differential operators. The basis for the developed algorithms is a homotopy method which departs from a wellunderstood selfadjoint problem. Apart from the adaptive grid refinement, the progress of the homotopy as well as the solution of the iterative method are adapted to balance the contrib...
متن کاملIterative learning identification and control for dynamic systems described by NARMAX model
A new iterative learning controller is proposed for a general unknown discrete time-varying nonlinear non-affine system represented by NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model. The proposed controller is composed of an iterative learning neural identifier and an iterative learning controller. Iterative learning control and iterative learning identification ar...
متن کاملProjective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting
This work is concerned with the classical problem of finding a zero of a sum of maximal monotone operators. For the projective splitting framework recently proposed by Combettes and Eckstein, we show how to replace the fundamental subproblem calculation using a backward step with one based on two forward steps. The resulting algorithms have the same kind of coordination procedure and can be imp...
متن کاملApplication of Non-Linear Functions at Distribution of Output SINR Gaussian Interference Channels
We have examined the convergence behavior of the LSCMA in some simple environments. Algorithms such as Multi¬ Target CMA, Multistage CMA, and Iterative Least Squares with Projection can be used for this purpose. The results presented here can form a basis for analysis of these multi-signal extraction techniques. Clearly, the variance and distribution of output SINR obtained with the LSCMA is al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Methods and Software
دوره 25 شماره
صفحات -
تاریخ انتشار 2010